Sampling Subgraph Network With Application to Graph Classification
نویسندگان
چکیده
Graphs are naturally used to describe the structures of various real-world systems in biology, society, computer science etc., where subgraphs or motifs as basic blocks play an important role function expression and information processing. However, existing research focuses on statistics certain motifs, largely ignoring connection patterns among them. Recently, a subgraph network (SGN) model is proposed study potential structure it was found that integration SGN can enhance series graph classification methods. lacks diversity quite high time complexity, making difficult widely apply practice. In this paper, we introduce sampling strategies into SGN, design novel model, which scale-controllable higher diversity. We also present structural feature fusion framework integrate features diverse SGNs, so improve performance classification. Extensive experiments demonstrate that, by comparing with our new indeed has much lower complexity (reduced two orders magnitude)
منابع مشابه
Subgraph Frequencies and Network Classification
Current metrics used in summarizing networks, such as degree distribution, average diameter and clustering coefficient, provide a very coarse understanding of their structure. One would like to have finergrained summaries of networks which allow making distinction between structurally different networks. A class of such interesting graph statistics are the Small Subgraph Frequencies. These subg...
متن کاملGraph animals, subgraph sampling, and motif search in large networks.
We generalize a sampling algorithm for lattice animals (connected clusters on a regular lattice) to a Monte Carlo algorithm for "graph animals," i.e., connected subgraphs in arbitrary networks. As with the algorithm in [N. Kashtan et al., Bioinformatics 20, 1746 (2004)], it provides a weighted sample, but the computation of the weights is much faster (linear in the size of subgraphs, instead of...
متن کاملAn Application of Boosting to Graph Classification
This paper presents an application of Boosting for classifying labeled graphs, general structures for modeling a number of real-world data, such as chemical compounds, natural language texts, and bio sequences. The proposal consists of i) decision stumps that use subgraph as features, and ii) a Boosting algorithm in which subgraph-based decision stumps are used as weak learners. We also discuss...
متن کاملA Bayesian Approach to Graph Regression with Relevant Subgraph Selection
Many real-world applications with graph data require the solution of a given regression task as well as the identification of the subgraphs which are relevant for the task. In these cases graphs are commonly represented as high dimensional binary vectors of indicators of subgraphs. However, since the dimensionality of such indicator vectors can be high even for small datasets, traditional regre...
متن کاملNetwork Sampling via Edge-based Node Selection with Graph Induction
In order to efficiently study the characteristics of network domains and support development of network systems (e.g. algorithms, protocols that operate on networks), it is often necessary to sample a representative subgraph from a large complex network. While prior research has shown that topological (e.g. random-walk based) sampling methods produce more accurate samples than approaches based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Network Science and Engineering
سال: 2021
ISSN: ['2334-329X', '2327-4697']
DOI: https://doi.org/10.1109/tnse.2021.3115104